A convolutional single-parity-check concatenated coding scheme for high-data-rate applications

نویسندگان

  • Robert Schweikert
  • A. J. Han Vinck
چکیده

Absfmcf-The paper describes the possible implementation of concatenated coding scheme suitable particularly for high date rate applications. The proposed coding scheme uses a set of n convolutional codes multiplexed into an inner code and a (n, n 1) single-parity-check code serving as the outer code. Each of the inner convolutional codes is decoded independently with maximum-likelihood decoding being achieved via n parallel implementations of the Viterbi algorithm. The Viterbi decoding is followed by additional outer soft-decision single-parity-check decoding. Considering n = 12 and the set of short constraint length K = 3, rate 1/2 convolutional codes, it is shown, that the performance of the concatenated scheme is comparable to the performance of the constraint length K = 7, rate 1/2 convolutional code with standard soft-decision Viterbi decoding. Simulation results are presented for the K = 3, rate 1/2 as well as for the punctured K = 3, rate 2/3 and rate 3/4 inner convolutional codes. Moreover, the performance of the proposed concatenated scheme using a set of K = 7, rate 1/2 inner convolutional codes is given. CONV. CODER m I I

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance evaluation of parallel concatenated codes - Communications, 1995. ICC '95 Seattle, 'Gateway to Globalization', 1995 IEEE International Confere

A parallel concatenated coding scheme consists of two simple systematic constituent encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits followed by the parity check bits of both encoders. In this paper we propose a method to evaluate t...

متن کامل

Concatenated codes for fading channels based on recursive space-time trellis codes

We propose a class of codes which combine the principles of turbo coding and space–time trellis codes. It is first shown that several classes of space–time codes have an equivalent recursive realization. This fact is then exploited to design serial concatenated coding schemes with an outer code, interleaver, and an inner recursive space–time encoder. Two solutions are proposed in this paper—The...

متن کامل

Impact of Channel Concatenation in 3D MIMO encoded 4x2mm Wave Wireless Communication System on Color Image Transmission

Impact of Channel Concatenation in 3D MIMO encoded 4x2mm Wave Wireless Communication System on Color Image Transmission Mousumi Haque, Shaikh Enayet Ullah, Md. Rezaul Islam Department of Information and Communication Engineering (ICE), University of Rajshahi, Rajshahi, Bangladesh Department of Applied Physics and Electronic Engineering (APEE), University of Rajshahi, Rajshahi, Bangladesh ______...

متن کامل

Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes - Information Theory, IEEE Transactions on

AbstructA parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to the first encoder followed by the parity check bits of both encoders. This construction ...

متن کامل

Unveiling turbo codes: some results on parallel concatenated coding schemes

A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the rst encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to the rst encoder followed by the parity check bits of both encoders. This construction can be gener...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 39  شماره 

صفحات  -

تاریخ انتشار 1991